Expressibility of norms in temporal logic
نویسندگان
چکیده
In this short note we address the issue of expressing norms (such as obligations and prohibitions) in temporal logic. In particular, we address the argument from [1] that norms cannot be expressed in Linear Time Temporal Logic (LTL). Recently, doubts were raised in [1] regarding suitability of LTL and other temporal logics for expressing ‘real life’ norms. We claim that the argument in [1] does not show that LTL is unsuitable for expressing norms. Instead it shows that a translation of deontic notions such as obligations and permissions into temporal logic which interprets ‘obligatory’ as ‘always true’ and ‘permitted’ as ‘eventually true’ does not work, as could be expected. However, [1] is now often cited as an argument against using temporal logic for specifying norms in general. We would like to revisit the example which is considered paradoxical when specified in LTL in [1], and show that it is possible to exactly specify the set of conditions on runs which satisfy the norms from the example using standard LTL. We assume that the reader is familiar with temporal logic, in particular with the syntax and semantics of LTL. We use U for the Until operator, G for always in the future, F for some time in the future. The example is as follows (we compress it slightly without changing the meaning, and use the same variable names for propositions): 1. collection of personal information (A) is forbidden unless authorised by the court (C) 2. The destruction of personal information collected illegally before accessing it (B) excuses the illegal collection 3. collection of medical information (D) is forbidden unless collection of personal information is permitted As pointed out in [1], this classifies possible situations as compliant and noncompliant as follows:
منابع مشابه
Infinitely many precomplete with respect to parametric expressibility classes of formulas in a provability logic of propositions
In the present paper we consider a non-tabular extension L of the well-known propositional provability logic GL together with the notion of parametric expressibility of formulas in a logic proposed by A. V. Kuznetsov. We prove that there are infinitely many precomplete with respect to parametric expressibility classes of formulas in the above mentioned logic L.
متن کاملOn sufficient conditions for expressibility of constants in the 4-valued extension of the propositional provability logic $GL$
In the present paper we consider the simplest non-classical extension GL4 of the well-known propositional provability logic GL together with the notion of expressibility of formulas in a logic proposed by A. V. Kuznetsov. Conditions for expressibility of constants in GL4 are found out, which were first announced in a author’s paper in 1996.
متن کاملApproximate formulae for a logic that capture classes of computational complexity
This paper presents a syntax of approximate formulae suited for the logic with counting quantifiers SOLP. This logic was formalised by us in [1] where, among other properties, we showed the following facts: (i) In the presence of a built–in (linear) order, SOLP can describe NP–complete problems and some of its fragments capture the classes P and NL; (ii) weakening the ordering relation to an al...
متن کاملAgent reasoning for norm compliance: a semantic approach
A system of autonomous agents may exhibit undesirable or ineffective behavior if no form of regulation is imposed. Norms, describing how agents should ideally behave, can be used to address this issue if agents are able to reason about norms and adapt their behavior to comply with them (if they choose to do so). Assuming that which norms will have to be followed is unknown at design time, it is...
متن کاملVerifying Compliance of Business Processes with Temporal Answer Sets
In this paper we provide a framework for the specification and the verification of business processes, which is based on a temporal extension of answer set programming (ASP) and we address the problem of verifying the compliance of business processes to norms. The logical formalism we use, is a combination of Answer Set Programming and Dynamic Linear Time Temporal Logic (DLTL), and allows for a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1608.06787 شماره
صفحات -
تاریخ انتشار 2016